Spectral Clustering, Markov Chains, and the Multicut Lemma
نویسنده
چکیده
1 Preliminaries In the following, W will be a symmetric n × n matrix with non-negative elements. The assumption is that W ij are weights corresponding to the edges ij of a (complete) graph (V, E) with vertices indexed by the numbers 1,. .. n. The indices k, l will be used to index subsets of V in a partition; we will call these subsets clusters. The indices i, j will index elements of V .
منابع مشابه
Taylor Expansion for the Entropy Rate of Hidden Markov Chains
We study the entropy rate of a hidden Markov process, defined by observing the output of a symmetric channel whose input is a first order Markov process. Although this definition is very simple, obtaining the exact amount of entropy rate in calculation is an open problem. We introduce some probability matrices based on Markov chain's and channel's parameters. Then, we try to obtain an estimate ...
متن کاملG-PCCA: Spectral Clustering for Non-reversible Markov Chains
Spectral clustering methods are based on solving eigenvalue problems for the identification of clusters, e.g., the identification of metastable subsets of a Markov chain. Usually, real-valued eigenvectors are mandatory for this type of algorithms. The Perron Cluster Analysis (PCCA+) is a well-known spectral clustering method of Markov chains. It is applicable for reversible Markov chains, becau...
متن کاملMarkov Chains and Spectral Clustering
The importance of Markov chains in modeling diverse systems, including biological, physical, social and economic systems, has long been known and is well documented. More recently, Markov chains have proven to be effective when applied to internet search engines such as Google’s PageRank model [7], and in data mining applications wherein data trends are sought. It is with this type of Markov ch...
متن کاملApplications of geometric bounds to the convergence rate of Markov chains on Rn
Quantitative geometric rates of convergence for reversible Markov chains are closely related to the spectral gap of the corresponding operator, which is hard to calculate for general state spaces. This article describes a geometric argumen t to give di erent types of bounds for spectral gaps of Markov chains on bounded subsets of R and to compare the rates of convergence of di erent Markov chai...
متن کاملOn the spectral analysis of second-order Markov chains
Second order Markov chains which are trajectorially reversible are considered. Contrary to the reversibility notion for usual Markov chains, no symmetry property can be deduced for the corresponding transition operators. Nevertheless and even if they are not diagonalizable in general, we study some features of their spectral decompositions and in particular the behavior of the spectral gap unde...
متن کامل